منابع مشابه
Sampling contingency tables
Given positive integers r1; r2; : : : rm and c1; c2; : : : cn, let I(r; c) be the set ofm n arrays with nonnegative integer entries and row sums r1; r2; : : : rm respectively and column sums c1; c2; : : : cn respectively. Elements of I(r; c) are called contingency tables with these row and column sums. We consider two related problems on contingency tables. Given r1; r2; : : : rm and c1; c2; : ...
متن کاملEfficient Importance Sampling for Binary Contingency Tables
Importance sampling has been reported to produce algorithms with excellent empirical performance in counting problems. However, the theoretical support for its efficiency in these applications has been very limited. In this paper, we propose a methodology that can be used to design efficient importance sampling algorithms for counting and test their efficiency rigorously. We apply our technique...
متن کاملImproved Bounds for Sampling Contingency Tables
We study the problem of sampling contingency tables (nonnegative integer matrices with specified row and column sums) uniformly at random. We give an algorithm which runs in polynomial time provided that the row sums ri and the column sums cj satisfy ri (n 3/ m log m), and cj (m 3/ n log n). This algorithm is based on a reduction to continuous sampling from a convex set. The same approach was t...
متن کاملLattice Points, Contingency Tables, and Sampling
Markov chains and sequential importance sampling (SIS) are described as two leading sampling methods for Monte Carlo computations in exact conditional inference on discrete data in contingency tables. Examples are explained from genotype data analysis, graphical models, and logistic regression. A new Markov chain and implementation of SIS are described for logistic regression.
متن کاملPolynomial-time counting and sampling of two-rowed contingency tables
In this paper a Markov chain for contingency tables with two rows is defined. The chain is shown to be rapidly mixing using the path coupling method. We prove an upper bound for the mixing time of the chain. The upper bound is quadratic in the number of columns and linear in the logarithm of the table sum. By considering a specific problem, we prove a lower bound for the mixing time of the chai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2018
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2017.10.001